I/O-Efficient Undirected Shortest Paths with Unbounded Weights
نویسندگان
چکیده
We present an algorithm for computing single-source shortest paths in undirected graphs with non-negative edge weights in O( √ nm/B logn+MST(n,m)) I/Os, where n is the number of vertices, m is the number of edges, B is the disk block size, and MST(n,m) is the I/O-cost of computing a minimum spanning tree. Our algorithm is based on our previous algorithm for graphs with bounded edge weights. Our contribution is the removal of the algorithm’s dependence on the edge weights.
منابع مشابه
I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths
We show how to compute single-source shortest paths in undirected graphs with non-negative edge lengths in O( p nm/B logn+ MST (n, m)) I/Os, where n is the number of vertices, m is the number of edges, B is the disk block size, and MST (n, m) is the I/O-cost of computing a minimum spanning tree. For sparse graphs, the new algorithm performs O((n/ √ B) logn) I/Os. This result removes our previou...
متن کاملI/O-Efficient Undirected Shortest Paths
We present an I/O-efficient algorithm for the single-source shortest path problem on undirected graphs G = (V,E). Our algorithm performs O( p (V E/B) log2(W/w) + sort(V +E) log log(V B/E)) I/Os , where w ∈ R andW ∈ R are the minimal and maximal edge weights in G, respectively. For uniform random edge weights in (0, 1], the expected I/O-complexity of our algorithm is O( p V E/B + ((V +E)/B) log2...
متن کاملExternal Memory Algorithms for Diameter and All-Pairs Shortest-Paths on Sparse Graphs
We provide I/O-efficient algorithms for diameter and allpairs shortest-paths (APSP) on undirected graphs G(V,E). For general non-negative edge weights and E/V = o(B/ log V ) our approaches are the first to achieve o(V ) I/Os. We also show that unweighted APSP can be solved with just O(V · sort(E)) I/Os; these approaches require O(V ) space. For diameter computations we additionally provide I/Os...
متن کاملAll Pairs Shortest Paths in Undirected Graphs with Integer Weights
We show that the All Pairs Shortest Paths (APSP) problem for undirected graphs with integer edge weights taken from the range f1; 2; : : : ;Mg can be solved using only a logarithmic number of distance products of matrices with elements in the range f1; 2; : : : ;Mg. As a result, we get an algorithm for the APSP problem in such graphs that runs in ~ O(Mn!) time, where n is the number of vertices...
متن کاملImproved Shortest Paths on the Word RAM
Thorup recently showed that single-source shortest-paths problems in undirected networks with n vertices, m edges, and edge weights drawn from {0, . . . , 2 − 1} can be solved in O(n+m) time and space on a unit-cost random-access machine with a word length of w bits. His algorithm works by traversing a so-called component tree. Two new related results are provided here. First, and most importan...
متن کامل